totally disconnected meaning in Chinese
完全不连通的
Examples
- Making of the totally disconnected fractal graphics
一类全不连通分形图的构造 - Let f be a biquadratic polynomial , then ( 1 ) the julia set of f is connected if and only if the orbits of all critical pionts are bounded ; ( 2 ) the julia set of f is totally disconnected if and only if every connected component of the filled julia set of f containing critical points is not periodic under iterations : ( 3 ) if f does not satisfy the conditions ( 1 ) and ( 2 ) , then the julia set of f has infinitely many non - trivial connected components , where a component is trivial if it contains only one point
A集是完全不连通的当且仅当f的任何临界声、不属于填充julm集的周期分支内。你当j的临界卢、不满足条件小， ” j时， f的几ha集有可数个非平凡的连通分支，这里，一个分支是平凡的，如果它仅由一个卢、组成。 。 - But the difficulty with these two parameters is that they do not take into account what remains after the graph is disconnected . in fact , on one hand , it is often found that two graphs with the same number of vertices ( edges ) and the same connectivity ( edge - connectivity ) ) may result in entirely different forms after a minimum disconnecting set of vertices ( edges ) is removed , one may be totally disconnected while the other may consist of a few very stable components , and thus be much easier to reconstruct
对于两个具有相同点(边)数，具有相同点连通度(边连通度)的图，从图中分别去掉使图不连通的点(边)集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。